Technologies DIT - University of Trento D ISTRIBUTED O NTOLOGICAL R EASONING : T HEORY , A LGORITHMS , AND A PPLICATIONS

نویسندگان

  • Andrei Tamilin
  • Luciano Serafini
  • Marie-Christine Rousset
  • Heiner Stuckenschmidt
  • Sergio Tessaris
چکیده

Research on ontologies is becoming a popular topic in various branches of computer science. Their importance has been recognized in knowledge representation, natural language processing, knowledge management, multi-agent systems, intelligent integration of databases, cooperation of distributed applications, and web services. Among others, it gets a special accent and strong push in the context of recently introduced semantic web. During the last years, academia materialized the ontology technology with a variety of theoretical and practical pillars: representational languages, stable underpinning theory, inference algorithms. Developed technology is mature enough to find a wide practical application in a range of scenarios when a single ontology is kept in mind – all the tools are off the shelf. The difficulty and challenge arise when multiple autonomously developed ontologies come into play. This thesis proposes a novel distributed reasoning technique for the setting of multiple ontologies on the semantic web. Unlike standard approaches that are based on integrating several ontologies into a monolithic global ontology and further reasoning in it, the proposed technique adopts a peer-to-peer approach wherein the reasoning results from a coordination of local reasoners associated to each autonomous ontology. Theoretically, the approach is grounded on a Distributed Description Logics framework (DDL). The thesis elaborates inference mechanisms in DDL and introduces sound and complete distributed tableaux algorithms for reasoning with multiple ontologies expressed in SHIQ Description Logic. To estimate the feasibility of the proposed technique and enable its practical deployment on the semantic web, the thesis proposes and implements a distributed reasoning engine entitled DRAGO (Distributed Reasoning Architecture for Galaxy of Ontologies). The system has been evaluated over several application scenarios and demonstrated the suitability and promising results for application of the proposed technique on the semantic web.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Merging By Decentralized Eventual Consistency Algorithms

Merging mechanism is an essential operation for version control systems. When each member of collaborative development works on an individual copy of the project, software merging allows to reconcile modifications made concurrently as well as managing software change through branching. The collaborative system is in charge to propose a merge result that includes user’s modifications. T h e u s ...

متن کامل

D Istributed a Lgorithms for S Patial R Etrieval Q Ueries in G Eospatial a Nalysis

The proliferation of data acquisition devices like 3D laser scanners had led to the burst of large-scale spatial terrain data which imposes many challenges to spatial data analysis and computation. With the advent of several emerging cloud technologies, a natural and cost-effective approach to managing such large-scale data is to store and process such datasets in a publicly hosted cloud servic...

متن کامل

Pattern Recognition and Machine Learning

his book provides an introduction to the eld of pattern recognition and machine earning. It gives an overview of several asic and advanced topics in machine earning theory. The book is definitely aluable to scientists and engineers who re involved in developing machine learnng tools applied to signal and image proessing applications. This book is also uitable for courses on machine learning nd ...

متن کامل

A Graph Coloring Algorithm for Large Scheduling Problems*

A ne w graph coloring algorit hm is prese nt ed and compared to a wide variety of known algorit hms. The algorithm is shown to exhibit O(n 2) time be havior for most s parse graphs and thus is found to be parti cularl y well suited for use wi th large-scale sc heduling problems. In addition, a procedure for ge nerating large random test graphs with known chromatic number is present ed and is us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007